Managing the Complexity of Lookahead for LU Factorization with Pivoting∗ FLAME Working Note #40
نویسندگان
چکیده
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) using classical partial pivoting versus recently proposed incremental pivoting and (2) extracting parallelism only within the Basic Linear Algebra Subprograms versus building and scheduling a directed acyclic graph of tasks. Performance comparisons are given on two different systems.
منابع مشابه
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملLAPACK Working Note ? LAPACK Block Factorization Algorithms on the Intel iPSC / 860 ∗
The aim of this project is to implement the basic factorization routines for solving linear systems of equations and least squares problems from LAPACK—namely, the blocked versions of LU with partial pivoting, QR, and Cholesky on a distributed-memory machine. We discuss our implementation of each of the algorithms and the results we obtained using varying orders of matrices and blocksizes.
متن کاملAchieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting
The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore process...
متن کاملA Comparison of Pivoting Strategies for the Direct LU Factorization
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm fr...
متن کاملNAG Fortran Library Routine Document F11DNF
F11DNF Note: before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details. 1 Purpose F11DNF computes an incomplete LU factorization of a complex sparse non-Hermitian matrix, represented in coordinate storage format. This factorization may be used as a preconditioner in combination w...
متن کامل